Computational Complexity of Sparse Rational Interpolation
نویسندگان
چکیده
منابع مشابه
Computational Complexity of Sparse Rational Interpolation
We analyse the computational complexity of sparse rational interpolation, and give the first deterministic algorithm for this problem with singly exponential bounds on the number of arithmetic operations. A preliminary version of this paper has appeared in [10] The first author would like to thank the Max Planck Institute in Bonn for its hospitality and support during the preparation of this pa...
متن کاملComputational Complexity of Sparse Real Algebraic Function Interpolation
We estimate the complexity of a general problem for interpolating real algebraic functions given by a black box for their evaluations, extending the results of [GKS 90b, GKS 91b] on interpolation of sparse rational functions.
متن کاملSparse interpolation of multivariate rational functions
Consider the black box interpolation of a τ -sparse, n-variate rational function f , where τ is the maximum number of terms in either numerator or denominator. When numerator and denominator are at most of degree d, then the number of possible terms in f is O(dn) and explodes exponentially as the number of variables increases. The complexity of our sparse rational interpolation algorithm does n...
متن کاملInterpolation of Sparse Rational Functions Without Knowing Bounds on Exponents
We present the first algorithm for the (black box) interpolation of t-sparse, n-variate rational functions without knowing bounds on exponents of their sparse representation with the number of queries independent on exponents. In fact, the algorithm uses O(ntt) queries to the black box, and can be implemented for a fixed t in a polynomially bounded storage (or polynomial parallel time). natural...
متن کاملMonotone Rational Trigonometric Interpolation
This study is concerned with the visualization of monotone data using a piecewise C rational trigonometric interpolating scheme. Four positive shape parameters are incorporated in the structure of rational trigonometric spline. Conditions on two of these parameters are derived to attain the monotonicity of monotone data and other two are left free. Figures are used widely to exhibit that the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1994
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539791194069